\hypertarget{kruskal_8h}{}\section{src/graph\+\_\+algorithms/minimum\+\_\+spanning\+\_\+tree/kruskal/kruskal.h File Reference}
\label{kruskal_8h}\index{src/graph\+\_\+algorithms/minimum\+\_\+spanning\+\_\+tree/kruskal/kruskal.\+h@{src/graph\+\_\+algorithms/minimum\+\_\+spanning\+\_\+tree/kruskal/kruskal.\+h}}
{\ttfamily \#include \char`\"{}src/set\+\_\+algorithms/disjoint\+\_\+set/disjointset.\+h\char`\"{}}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Graph\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Graph\+Type , typename Action\+Type  = std\+::function$<$ void(typename Graph\+Type\+::\+V\+I\+D\+Type,typename Graph\+Type\+::\+V\+I\+D\+Type)$>$$>$ }\\Graph\+Type\+::\+E\+Weight\+Type \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a2575c09c42d0b30b57702c9379d2fbfb}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::kruskal} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph, Action\+Type pre\+\_\+action=\mbox{[}$\,$\mbox{]}(typename Graph\+Type\+::\+V\+I\+D\+Type, typename Graph\+Type\+::\+V\+I\+D\+Type)\{\}, Action\+Type post\+\_\+action=\mbox{[}$\,$\mbox{]}(typename Graph\+Type\+::\+V\+I\+D\+Type, typename Graph\+Type\+::\+V\+I\+D\+Type)\{\})
\begin{DoxyCompactList}\small\item\em kruskal：最小生成树的\+Kruskal算法，算法导论23章23.2节 \end{DoxyCompactList}\end{DoxyCompactItemize}
